Verification of iterative matrix solutions for multipoint kinetics equations
نویسندگان
چکیده
منابع مشابه
Fast verification of solutions of matrix equations
In this paper, we are concerned with a matrix equation Ax = b where A is an n× n real matrix and x and b are n-vectors. Assume that an approximate solution e x is given together with an approximate LU decomposition. We will present fast algorithms for proving nonsingularity of A and for calculating rigorous error bounds for ‖A−1b − e x‖∞. The emphasis is on rigour of the bounds. The purpose of ...
متن کاملIterative Solutions to Some Linear Matrix Equations
In this paper the gradient based iterative algorithms are presented to solve the following four types linear matrix equations: (a) AXB = F ; (b) AXB = F, CXD = G; (c) AXB = F s. t. X = X ; (d) AXB+CY D = F, where X and Y are unknown matrices, A,B,C,D, F,G are the given constant matrices. It is proved that if the equation considered has a solution, then the unique minimum norm solution can be ob...
متن کاملIterative least-squares solutions of coupled Sylvester matrix equations
In this paper, we present a general family of iterative methods to solve linear equations, which includes the well-known Jacobi and Gauss–Seidel iterations as its special cases. The methods are extended to solve coupled Sylvester matrix equations. In our approach, we regard the unknown matrices to be solved as the system parameters to be identified, and propose a least-squares iterative algorit...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Nuclear Energy
سال: 2019
ISSN: 0306-4549
DOI: 10.1016/j.anucene.2018.09.036